0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.12	% Command    : run_E %s %d THM
0.12/0.32	% Computer : n025.cluster.edu
0.12/0.32	% Model    : x86_64 x86_64
0.12/0.32	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.32	% Memory   : 8042.1875MB
0.12/0.32	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1440
0.12/0.33	% WCLimit    : 180
0.12/0.33	% DateTime   : Thu Jul  4 06:19:39 EDT 2024
0.12/0.33	% CPUTime    : 
0.20/0.47	Running higher-order theorem proving
0.20/0.53	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.9F65pp5GnY/E---3.1_31095.p
0.52/0.61	# Version: 3.2.0-ho
0.52/0.61	# Preprocessing class: HSLSSMSSSSMNHSA.
0.52/0.61	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.52/0.61	# Starting sh1 with 900s (5) cores
0.52/0.61	# Starting new_ho_8 with 180s (1) cores
0.52/0.61	# Starting new_ho_11 with 180s (1) cores
0.52/0.61	# Starting sh5l with 180s (1) cores
0.52/0.61	# new_ho_8 with pid 31174 completed with status 0
0.52/0.61	# Result found by new_ho_8
0.52/0.61	# Preprocessing class: HSLSSMSSSSMNHSA.
0.52/0.61	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.52/0.61	# Starting sh1 with 900s (5) cores
0.52/0.61	# Starting new_ho_8 with 180s (1) cores
0.52/0.61	# SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
0.52/0.61	# Search class: HGHSM-FSLF31-MHSFFSBN
0.52/0.61	# partial match(1): HGHSM-FSLM31-MHSFFSBN
0.52/0.61	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.52/0.61	# Starting almost_fo_1 with 98s (1) cores
0.52/0.61	# almost_fo_1 with pid 31177 completed with status 0
0.52/0.61	# Result found by almost_fo_1
0.52/0.61	# Preprocessing class: HSLSSMSSSSMNHSA.
0.52/0.61	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.52/0.61	# Starting sh1 with 900s (5) cores
0.52/0.61	# Starting new_ho_8 with 180s (1) cores
0.52/0.61	# SinE strategy is GSinE(CountTerms,hypos,10,,2,20000,1.0,true)
0.52/0.61	# Search class: HGHSM-FSLF31-MHSFFSBN
0.52/0.61	# partial match(1): HGHSM-FSLM31-MHSFFSBN
0.52/0.61	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.52/0.61	# Starting almost_fo_1 with 98s (1) cores
0.52/0.61	# Preprocessing time       : 0.010 s
0.52/0.61	# Presaturation interreduction done
0.52/0.61	
0.52/0.61	# Proof found!
0.52/0.61	# SZS status Theorem
0.52/0.61	# SZS output start CNFRefutation
0.52/0.61	thf(decl_sort1, type, list_a: $tType).
0.52/0.61	thf(decl_sort2, type, a: $tType).
0.52/0.61	thf(decl_sort3, type, nat: $tType).
0.52/0.61	thf(decl_31, type, listIn1312259492pend_a: list_a > (nat > a) > nat > a).
0.52/0.61	thf(decl_35, type, append_a: list_a > list_a > list_a).
0.52/0.61	thf(decl_55, type, cons_a: a > list_a > list_a).
0.52/0.61	thf(decl_59, type, nil_a: list_a).
0.52/0.61	thf(decl_104, type, f: nat > a).
0.52/0.61	thf(decl_105, type, x: a).
0.52/0.61	thf(decl_106, type, xs: list_a).
0.52/0.61	thf(conj_0, conjecture, ((listIn1312259492pend_a @ (cons_a @ x @ xs) @ f)=(listIn1312259492pend_a @ (cons_a @ x @ nil_a) @ (listIn1312259492pend_a @ xs @ f))), file('/export/starexec/sandbox/tmp/tmp.9F65pp5GnY/E---3.1_31095.p', conj_0)).
0.52/0.61	thf(fact_151_i__append__assoc, axiom, ![X4:list_a, X3:list_a, X237:nat > a]:(((listIn1312259492pend_a @ X4 @ (listIn1312259492pend_a @ X3 @ X237))=(listIn1312259492pend_a @ (append_a @ X4 @ X3) @ X237))), file('/export/starexec/sandbox/tmp/tmp.9F65pp5GnY/E---3.1_31095.p', fact_151_i__append__assoc)).
0.52/0.61	thf(fact_186_append__eq__Cons, axiom, ![X1:a, X4:list_a]:(((append_a @ (cons_a @ X1 @ nil_a) @ X4)=(cons_a @ X1 @ X4))), file('/export/starexec/sandbox/tmp/tmp.9F65pp5GnY/E---3.1_31095.p', fact_186_append__eq__Cons)).
0.52/0.61	thf(c_0_3, negated_conjecture, ((listIn1312259492pend_a @ (cons_a @ x @ xs) @ f)!=(listIn1312259492pend_a @ (cons_a @ x @ nil_a) @ (listIn1312259492pend_a @ xs @ f))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
0.52/0.61	thf(c_0_4, negated_conjecture, ((listIn1312259492pend_a @ (cons_a @ x @ xs) @ f)!=(listIn1312259492pend_a @ (cons_a @ x @ nil_a) @ (listIn1312259492pend_a @ xs @ f))), inference(fof_nnf,[status(thm)],[c_0_3])).
0.52/0.61	thf(c_0_5, plain, ![X1471:list_a, X1472:list_a, X1473:nat > a]:(((listIn1312259492pend_a @ X1471 @ (listIn1312259492pend_a @ X1472 @ X1473))=(listIn1312259492pend_a @ (append_a @ X1471 @ X1472) @ X1473))), inference(variable_rename,[status(thm)],[fact_151_i__append__assoc])).
0.52/0.61	thf(c_0_6, plain, ![X1697:a, X1698:list_a]:(((append_a @ (cons_a @ X1697 @ nil_a) @ X1698)=(cons_a @ X1697 @ X1698))), inference(variable_rename,[status(thm)],[fact_186_append__eq__Cons])).
0.52/0.61	thf(c_0_7, negated_conjecture, ((listIn1312259492pend_a @ (cons_a @ x @ xs) @ f)!=(listIn1312259492pend_a @ (cons_a @ x @ nil_a) @ (listIn1312259492pend_a @ xs @ f))), inference(split_conjunct,[status(thm)],[c_0_4])).
0.52/0.61	thf(c_0_8, plain, ![X2:list_a, X3:list_a, X237:nat > a]:(((listIn1312259492pend_a @ X2 @ (listIn1312259492pend_a @ X3 @ X237))=(listIn1312259492pend_a @ (append_a @ X2 @ X3) @ X237))), inference(split_conjunct,[status(thm)],[c_0_5])).
0.52/0.61	thf(c_0_9, plain, ![X1:a, X2:list_a]:(((append_a @ (cons_a @ X1 @ nil_a) @ X2)=(cons_a @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.52/0.61	thf(c_0_10, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8]), c_0_9])]), ['proof']).
0.52/0.61	# SZS output end CNFRefutation
0.52/0.61	# Parsed axioms                        : 450
0.52/0.61	# Removed by relevancy pruning/SinE    : 281
0.52/0.61	# Initial clauses                      : 497
0.52/0.61	# Removed in clause preprocessing      : 12
0.52/0.61	# Initial clauses in saturation        : 485
0.52/0.61	# Processed clauses                    : 157
0.52/0.61	# ...of these trivial                  : 6
0.52/0.61	# ...subsumed                          : 21
0.52/0.61	# ...remaining for further processing  : 130
0.52/0.61	# Other redundant clauses eliminated   : 58
0.52/0.61	# Clauses deleted for lack of memory   : 0
0.52/0.61	# Backward-subsumed                    : 0
0.52/0.61	# Backward-rewritten                   : 3
0.52/0.61	# Generated clauses                    : 49
0.52/0.61	# ...of the previous two non-redundant : 21
0.52/0.61	# ...aggressively subsumed             : 0
0.52/0.61	# Contextual simplify-reflections      : 0
0.52/0.61	# Paramodulations                      : 0
0.52/0.61	# Factorizations                       : 0
0.52/0.61	# NegExts                              : 0
0.52/0.61	# Equation resolutions                 : 58
0.52/0.61	# Disequality decompositions           : 0
0.52/0.61	# Total rewrite steps                  : 41
0.52/0.61	# ...of those cached                   : 24
0.52/0.61	# Propositional unsat checks           : 0
0.52/0.61	#    Propositional check models        : 0
0.52/0.61	#    Propositional check unsatisfiable : 0
0.52/0.61	#    Propositional clauses             : 0
0.52/0.61	#    Propositional clauses after purity: 0
0.52/0.61	#    Propositional unsat core size     : 0
0.52/0.61	#    Propositional preprocessing time  : 0.000
0.52/0.61	#    Propositional encoding time       : 0.000
0.52/0.61	#    Propositional solver time         : 0.000
0.52/0.61	#    Success case prop preproc time    : 0.000
0.52/0.61	#    Success case prop encoding time   : 0.000
0.52/0.61	#    Success case prop solver time     : 0.000
0.52/0.61	# Current number of processed clauses  : 78
0.52/0.61	#    Positive orientable unit clauses  : 24
0.52/0.61	#    Positive unorientable unit clauses: 0
0.52/0.61	#    Negative unit clauses             : 7
0.52/0.61	#    Non-unit-clauses                  : 47
0.52/0.61	# Current number of unprocessed clauses: 349
0.52/0.61	# ...number of literals in the above   : 1267
0.52/0.61	# Current number of archived formulas  : 0
0.52/0.61	# Current number of archived clauses   : 3
0.52/0.61	# Clause-clause subsumption calls (NU) : 428
0.52/0.61	# Rec. Clause-clause subsumption calls : 399
0.52/0.61	# Non-unit clause-clause subsumptions  : 17
0.52/0.61	# Unit Clause-clause subsumption calls : 59
0.52/0.61	# Rewrite failures with RHS unbound    : 0
0.52/0.61	# BW rewrite match attempts            : 2
0.52/0.61	# BW rewrite match successes           : 2
0.52/0.61	# Condensation attempts                : 0
0.52/0.61	# Condensation successes               : 0
0.52/0.61	# Termbank termtop insertions          : 40886
0.52/0.61	# Search garbage collected termcells   : 14750
0.52/0.61	
0.52/0.61	# -------------------------------------------------
0.52/0.61	# User time                : 0.042 s
0.52/0.61	# System time              : 0.012 s
0.52/0.61	# Total time               : 0.054 s
0.52/0.61	# Maximum resident set size: 4744 pages
0.52/0.61	
0.52/0.61	# -------------------------------------------------
0.52/0.61	# User time                : 0.060 s
0.52/0.61	# System time              : 0.014 s
0.52/0.61	# Total time               : 0.074 s
0.52/0.61	# Maximum resident set size: 2860 pages
0.52/0.61	% E---3.1 exiting
0.62/0.61	% E exiting
0.62/0.61	EOF